Modular Class Analysis with DATALOG

نویسندگان

  • Frédéric Besson
  • Thomas P. Jensen
چکیده

datalog can be used to specify a variety of class analyses for object oriented programs as variations of a common framework In this framework the result of analyzing a class is a set of datalog clauses whose least xpoint is the information analysed for Modular class anal ysis of program fragments is then expressed as the resolution of open datalog programs We provide a theory for the partial resolution of sets of open clauses and de ne a number of operators for reducing such open clauses

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modular Logic Programs over Finite Domains

In this paper we study the properties of a compositional semantics for logic programs and its applications to modular analysis and logic-based databases, focusing on programs deened on a nite domain (i.e. on a function free nite signature). By this restriction we obtain a nite characterization of the compositional semantics which has the same correctness and compositionality properties of the o...

متن کامل

Inheritance in Object Oriented Datalog : A Modular Logic Programming

Modularity is a special form of logic programming composition that allows incremental development and code reusability. It is natural to be considered as the formal framework to supply semantics to languages of logic programs (such as datalog) when the underlying data model is object oriented. We show here that a) for various interesting forms of inheritance, clean and natural semantics can ind...

متن کامل

$C$-class functions on common fixed point theorems for weak‎ ‎contraction mapping of integral type in modular spaces

‎In this paper‎, ‎we use the concept of $C$-class functions introduced‎ ‎by Ansari [4] to prove the existence and uniqueness of‎ ‎common fixed point for self-mappings in modular spaces of integral‎ ‎inequality‎. ‎Our results extended and generalized previous known‎ ‎results in this direction‎.

متن کامل

Using Datalog for Fast and Easy Program Analysis

Our recent work introduced the D framework for points-to analysis of Java programs. Although Datalog has been used for points-to analyses before, D is the first implementation to express full end-to-end context-sensitive analyses in Datalog. This includes key elements such as call-graph construction as well as the logic dealing with various semantic complexities of the Java language (nati...

متن کامل

A Datalog + Plus RuleML 1.01 Architecture for Rule-Based Data Access in Ecosystem Research

Rule-Based Data Access (RBDA) enables automated reasoning over a knowledge base (KB) as a generalized global schema for the data in local (e.g., relational or graph) databases reachable through mappings. RBDA can semantically validate, enrich, and integrate heterogeneous data sources. This paper proposes an RBDA architecture layered on Datalog RuleML, and uses it for the ∆Forest case study on t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003